On the Expressive Power of IF-Logic with Classical Negation
نویسندگان
چکیده
It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ 1) and, therefore, is not closed under classical negation. The boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆2. In this paper we consider IF-logic extended with Hodges’ flattening operator, which allows classical negation to occur also under the scope of IF quantifiers. We show that, nevertheless, the expressive power of this logic does not go beyond ∆2. As part of the proof, we give a prenex normal form result and introduce a non-trivial syntactic fragment of full second-order logic that we show to be contained in ∆2.
منابع مشابه
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
It is well-known that Independence Friendly (IF) logic is equivalent to existential second-order logic (Σ1) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of ∆2. In this article we consider SL(↓), IF-logic extended with Hodges’ flattening operator ↓, which allows to define...
متن کاملDistributed Contingency Logic and Security
In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...
متن کاملAnswers Synthesis for CLP with Negation
Rewrite techniques can be used to execute logic programs in order to avoid some drawbacks of classical Prolog resolution. Logic programs are represented as rewrite programs whose operational mechanism, inspired from Knuth-Bendix completion, allows to prune some unnecessary computations and offers a synthesis ability which enables to represent infinite sets of answers as finite sets of formulas....
متن کاملHierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic
We establish a general hierarchy theorem for quantiier classes in the innnitary logic L ! 1! on nite structures. In particular, it is shown that no innnitary formula with bounded number of universal quantiiers can express the negation of a transitive closure. This implies the solution of several open problems in nite model theory: On nite structures, positive transitive closure logic is not clo...
متن کاملPolynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates
We consider instance queries mediated by an ontology expressed in the expressive DL ALCHIO with closed predicates. We observe that such queries are non-monotonic and cannot be expressed in monotonic variants of DATALOG, but a polynomial time translation into disjunctive DATALOG extended with negation as failure is feasible. If no closed predicates are present–in the case of classical instance c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011